Global Optimization in Geometry | Circle Packing into the Squarep
نویسنده
چکیده
منابع مشابه
Global Optimization in Geometry — Circle Packing into the Square
The present review paper summarizes the research work done mostly by the authors on packing equal circles in the unit square in the last years.
متن کاملGeneral Ellipse Packings in an Optimized Circle Using Embedded Lagrange Multipliers
The general ellipse packing problem is to find a non-overlapping arrangement of n ellipses with (in principle) arbitrary size and orientation parameters inside a given type of container set. Here we consider the general ellipse packing problem with respect to an optimized circle container with minimal radius. Following the review of selected topical literature, we introduce a new model formulat...
متن کاملExact Methods for Recursive Circle Packing
Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first exact method for ...
متن کاملOn the global minimum in a balanced circular packing problem
The paper considers balanced packing problem of a given family of circles into a larger circle of the minimal radius as a multiextremal nonlinear programming problem. We reduce the problem to unconstrained minimization problem of a nonsmooth function by means of nonsmooth penalty functions. We propose an efficient algorithm to search for local extrema and an algorithm for improvement of the low...
متن کاملPacking circles in a square: a theoretical comparison of various convexification techniques
We consider the problem of packing congruent circles with the maximum radius in a unit square. As a mathematical program, this problem is a notoriously difficult nonconvex quadratically constrained optimization problem which possesses a large number of local optima. We study several convexification techniques for the circle packing problem, including polyhedral and semi-definite relaxations and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007